Perfect one-factorizations in generalized Petersen graphs
نویسندگان
چکیده
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. We consider the case in which G is a cubic graph. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. We give conditions for determining P1F graphs within a subfamily of generalized Petersen graphs.
منابع مشابه
The lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملOn the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
In this paper we use orderly algorithms to enumerate (perfect) one-factorizations of complete graphs, the automorphism groups of which contain certain prescribed subgroups. We showed that, for the complete graph Ki2, excluding those one-factorizations containing exactly one automorphism of six disjoint cycles of length two, there are precisely 56391 nonisomorphic one-factorizations of Ki2 with ...
متن کاملSome new perfect one-factorizations from starters in finite fields
We construct seven new examples of perfect one-factorizations, in the complete graphs K170, K730. K1370. K1850t and K3126. These are generated by twoand four-quotient starters in finite fields. We also find several examples of perfect one-factorizations that are not isomorphic to previously known examples.
متن کامل1 2 Ju l 2 01 7 On the forcing spectrum of generalized Petersen graphs P ( n , 2 ) ∗
The forcing number of a perfect matching M of a graph G is the smallest cardinality of subsets of M that are contained in no other perfect matchings of G. The forcing spectrum of G is the collection of forcing numbers of all perfect matchings of G. In this paper, we classify the perfect matchings of a generalized Petersen graph P (n, 2) in two types, and show that the forcing spectrum is the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 99 شماره
صفحات -
تاریخ انتشار 2011